A parallel-in-time multiple shooting algorithm for large-scale PDE-constrained optimal control problems

نویسندگان

چکیده

Multiple shooting methods for solving optimal control problems governed by ODEs have been extensively studied in past decades. However, their application large-scale PDE-based still faces many challenges, including the difficulty of large scale equality constrained optimization an efficient parallelizable way. The current work proposes and analyzes a new parallel-in-time multiple algorithm parabolic PDEs. We solve introduced strategy using augmented Lagrangian method, which unconstrained subproblems are solved classical limited-memory BFGS quasi-Newton method. An problem Nagumo equation is employed to validate proposed analyze its efficiency. results demonstrate that substantial accelerations can be achieved approaches when proper starting guesses controls provided, variables scaled appropriately. A second test case consists two-dimensional velocity tracking Navier–Stokes equations. influence flow complexity on method studied, illustrate fluid field with more complex structures, efficiency further increases. Overall, different cases considered, we find algorithmic speed-ups up 6 versus single shooting, depending guess, specific problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

A Shooting Algorithm for Optimal Control Problems with Singular Arcs

In this article we propose a shooting algorithm for a class of optimal control problems for which all control variables appear linearly. The shooting system has, in the general case, more equations than unknowns and the Gauss-Newton method is used to compute a zero of the shooting function. This shooting algorithm is locally quadratically convergent if the derivative of the shooting function is...

متن کامل

Distributed Multiple Shooting for Optimal Control of Large Interconnected Systems

Large interconnected systems consist of a multitude of subsystems with their own dynamics, but coupled with each other via input-output connections. Each subsystem is typically modelled by ordinary differential equations or differential-algebraic equations. Simulation and optimal control of such systems pose a challenge both with respect to CPU time and memory requirements. We address optimal c...

متن کامل

Well-Posedness of the Shooting Algorithm for State Constrained Optimal Control Problems with a Single Constraint and Control

This paper deals with the shooting algorithm for optimal control problems with a scalar control and a regular scalar state constraint. Additional conditions are displayed, under which the so-called alternative formulation is equivalent to Pontryagin’s minimum principle. The shooting algorithm appears to be well-posed (invertible Jacobian), iff (i) the no-gap second order sufficient optimality c...

متن کامل

Decomposition-based evolutionary algorithm for large scale constrained problems

Cooperative Coevolutionary algorithms (CC) have been successful in solving large scale optimization problems. The performance of CC can be improved by decreasing the number of interdependent variables among decomposed subproblems. This is achieved by first identifying dependent variables, and by then grouping them in common subproblems. This approach has potential because so far no grouping tec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2022

ISSN: ['1090-2716', '0021-9991']

DOI: https://doi.org/10.1016/j.jcp.2021.110926